Temperature Parallel Simulated Annealing with Adaptive Neighborhood for Continuous Optimization Problem

نویسندگان

  • MITSUNORI MIKI
  • TOMOYUKI
چکیده

In this study, a temperature parallel simulated annealing with adaptive neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rates. Because of this mechanism, the proposed method provides global search in the processors of parallel computers for high temperatures and local search in the processors for low temperatures in TPSA/AN. Therefore, all the processors are used for searching very efficiently. The TPSA/AN is evaluated for the standard test functions, and it is found that adopting the adaptive neighborhood range increases the searching ability of TPSA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temperature Parallel Simulated Annealing with Adaptive Neighborhood

In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

متن کامل

Parallel simulated annealing with adaptive neighborhood determined by GA

Abstract – Simulated annealing (SA) is an effective general heuristic method for solving many optimization problems. This paper deals with the two problems in SA. One is the long computational time of the numerical annealings, and the solution to it is the parallel processing of SA. The other one is the determination of the appropriate neighborhood range in SA, and the solution to it is the int...

متن کامل

Simulated Annealing With Parameter Tuning for Wind Turbine Placement Optimization

Because of wake effects and geographical constraints, the search for optimal positions of wind turbines has an important part to play for their efficiency. The determination of their positions can be treated as optimization problem and can be solved by various methods. In this paper, we propose optimization approaches based on Simulated Annealing (SA) to improve solutions for the wind turbines ...

متن کامل

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

متن کامل

Simulated Annealing with Advanced Adaptive Neighborhood

It was Kirkpatrick et al. who first proposed simulated annealing, SA, as a method for solving combinatorial optimization problems[1]. It is reported that SA is very useful for several types of combinatorial optimization problems[2]. The advantages and the disadvantages of SA are well summarized in [3]. The most remarkable disadvantages are that it needs a lot of time to find the optimum solutio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999